Asymptotic degree distributions in large homogeneous random networks: A little theory and a counterexample
نویسندگان
چکیده
In random graph models, the degree distribution of an individual node should be distinguished from the (empirical) degree distribution of the graph that records the fractions of nodes with given degree. We introduce a general framework to explore when these two degree distributions coincide asymptotically in large homogeneous random networks. The discussion is carried under three basic statistical assumptions on the degree sequences: (i) a weak form of distributional homogeneity; (ii) the existence of an asymptotic (nodal) degree distribution; and (iii) a weak form of asymptotic uncorrelatedness. We show that this asymptotic equality may fail in homogeneous random networks for which (i) and (ii) hold but (iii) does not. The counterexample is found in the class of random threshold graphs. An implication of this finding is that random threshold graphs cannot be used as a substitute to the Barabási-Albert model for scale-free network modeling, as has been proposed by some authors. This work was supported in part by NSF Grant CCF-1217997. The paper was completed during the academic year 2014-2015 while A.M. Makowski was a Visiting Professor with the Department of Statistics of the Hebrew University of Jerusalem with the support of a fellowship from the Lady Davis Trust. This document does not contain technology or technical data controlled under either the U.S. International Traffic in Arms Regulations or the U.S. Export Administration Regulations. Parts of the material were presented in the 53rd IEEE Conference on Decision and Control (CDC 2015), Osaka (Japan), December 2015. S. Pal was with the Department of Electrical and Computer Engineering, and the Institute for Systems Research, University of Maryland, College Park, MD 20742 USA. He is now with Raytheon BBN Technologies (email: [email protected]). A. M. Makowski is with the Department of Electrical and Computer Engineering, and the Institute for Systems Research, University of Maryland, College Park, MD 20742 USA (e-mail: [email protected]).
منابع مشابه
Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence
We address here the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed degree sequence. Our goal is to provide an algorithm suitable for practical use both because of its ability to generate very large graphs (efficiency) and because it is easy to implement (simplicity). We focus on a family of heuristics for which we introduce optimality c...
متن کاملGlobal Asymptotic and Exponential Stability of Tri-Cell Networks with Different Time Delays
In this paper, a bidirectional ring network with three cells and different time delays is presented. To propose this model which is a good extension of three-unit neural networks, coupled cell network theory and neural network theory are applied. In this model, every cell has self-connections without delay but different time delays are assumed in other connections. A suitable Lyapun...
متن کاملAsymptotic Distributions of Estimators of Eigenvalues and Eigenfunctions in Functional Data
Functional data analysis is a relatively new and rapidly growing area of statistics. This is partly due to technological advancements which have made it possible to generate new types of data that are in the form of curves. Because the data are functions, they lie in function spaces, which are of infinite dimension. To analyse functional data, one way, which is widely used, is to employ princip...
متن کاملSIR dynamics in random networks with heterogeneous connectivity.
Random networks with specified degree distributions have been proposed as realistic models of population structure, yet the problem of dynamically modeling SIR-type epidemics in random networks remains complex. I resolve this dilemma by showing how the SIR dynamics can be modeled with a system of three nonlinear ODE's. The method makes use of the probability generating function (PGF) formalism ...
متن کاملThe Impact of Degree Variability on Connectivity Properties of Large Networks
The goal of this work is to study how increased variability in the degree distribution impacts the global connectivity properties of a large network. We approach this question by modeling the network as a uniform random graph with a given degree sequence. We analyze the effect of the degree variability on the approximate size of the largest connected component using stochastic ordering techniqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1710.11064 شماره
صفحات -
تاریخ انتشار 2017